Given two integer arrays nums1 and nums2, sorted in non-decreasing order, return the minimum integer common to both arrays. If there is no common integer amongst nums1 and nums2, return -1.
Note that an integer is said to be common to nums1 and nums2 if both arrays have at least one occurrence of that integer.
Input: nums1 = [1,2,3], nums2 = [2,4] Output: 2 Explanation: The smallest element common to both arrays is 2, so we return 2.
Input: nums1 = [1,2,3,6], nums2 = [2,3,4,5] Output: 2 Explanation: There are two common elements in the array 2 and 3 out of which 2 is the smallest, so 2 is returned.
1 <= nums1.length, nums2.length <= 1051 <= nums1[i], nums2[j] <= 109- Both
nums1andnums2are sorted in non-decreasing order.
implSolution{pubfnget_common(nums1:Vec<i32>,nums2:Vec<i32>) -> i32{letmut i = 0;letmut j = 0;while i < nums1.len() && j < nums2.len(){if nums1[i] == nums2[j]{return nums1[i];}elseif nums1[i] < nums2[j]{ i += 1;}else{ j += 1;}} -1}}